maximum vertex造句

Via this result, the minimum vertex cover, maximum independent set, and maximum vertex biclique problems may be solved in polynomial time for bipartite graphs.
More strongly, the degeneracy of a graph equals its maximum vertex degree if and only if at least one of the connected components of the graph is regular of maximum degree.
Now K鰊ig's Line Coloring Theorem, stating that the chromatic index equals the maximum vertex degree in any bipartite graph, can be interpreted as stating that the line graph of a bipartite graph is perfect.
According to, one of the main unsolved questions is the following : Does there exist a graph " G " such that " ? " ( " G " ) equals the eternal domination number of " G " and " ? " ( " G " ) is less than the clique covering number of " G " ? proved that any such graph must contain triangles and must have maximum vertex degree at least four.
It's difficult to find maximum vertex in a sentence. 用maximum vertex造句挺难的